Efficient scheduling algorithm for component-based networks

نویسندگان

  • Seokcheon Lee
  • Soundar R. T. Kumara
  • Natarajan Gautam
چکیده

In a grid computing environment, it is important to be capable of agilely quantifying the quality of service achievable by each alternative composition of resources. This capability is an essential driver to not only efficiently utilizing the resources but also promoting the virtual economy. In this paper, we design an efficient scheduling algorithm of minimizing completion time for component-based networks. The performance of the network is a function of resource assignment and resource allocation. Resource assignment assigns components to available machines and resource allocation allocates the resources of each machine to the residing components. Though similar problems can be found in the multiprocessor scheduling literature, our problem is different especially because the components in our networks process multiple tasks in parallel with their successor or predecessor components. The designed algorithm is simple but effective since it incorporates the fact that the components in a network can be considered independent under a certain resource allocation policy. c © 2006 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A hybrid GRASP algorithm for minimizing total weighted resource tardiness penalty costs in scheduling of project networks

In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ

An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...

متن کامل

An Algorithm to Obtain Possibly Critical Paths in Imprecise Project Networks

  We consider criticality in project networks having imprecise activity duration times. It is well known that finding all possibly critical paths of an imprecise project network is an NP-hard problem. Here, based on a method for finding critical paths of crisp networks by using only the forward recursion of critical path method, for the first time an algorithm is proposed which can find all pos...

متن کامل

Forecasting and Sensitivity Analysis of Monthly Evaporation from Siah Bisheh Dam Reservoir using Artificial neural Networks combined with Genetic Algorithm

Evaporation process, the main component of the water cycle in nature, is essential in agricultural studies, hydrology and meteorology, the operation of reservoirs, irrigation and drainage systems, irrigation scheduling and management of water resources. Various methods have been presented for estimating evaporation from free surface including water budget method, evaporation from pan and experi...

متن کامل

An Efficient Extension of Network Simplex Algorithm

In this paper, an efficient extension of network simplex algorithm is presented. In static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. In this paper, the Static Scheduling problem of Automated Guided Vehicles in container terminal is solved by Network Simplex Algorithm (NSA) and NSA+, which extended the stand...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Future Generation Comp. Syst.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2007